A construction of cylindric and polyadic algebras from atomic relation algebras

نویسنده

  • Ian Hodkinson
چکیده

Given a simple atomic relation algebra A and a finite n ≥ 3, we construct effectively an atomic n-dimensional polyadic equality-type algebra P such that for any subsignature L of the signature of P that contains the boolean operations and cylindrifications, the L-reduct of P is completely representable if and only if A is completely representable. If A is finite then so is P. It follows that there is no algorithm to determine whether a finite n-dimensional cylindric algebra, diagonal-free cylindric algebra, polyadic algebra, or polyadic equality algebra is representable (for diagonal-free algebras this was known). We also obtain a new proof that the classes of completely representable n-dimensional algebras of these types are nonelementary, a result that remains true for infinite dimensions if the diagonals are present, and also for infinite-dimensional diagonal-free cylindric algebras.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notions of Density That Imply Representability in Algebraic Logic

Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable (as a cylindric set algebra). This theorem and its analogues for quasi-polyadic algebras with and without equality are formulated in Henkin-Monk-Tarski 1985]. We introduce a natural and more general notion of rectangular density that can be applied to arbitrary cylindric and quasi-...

متن کامل

Introductory Course on Relation Algebras, Finite-dimensional Cylindric Algebras, and Their Interconnections

These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections, delivered at the Conference on Alge-Relation algebras (RA's) are closely linked to cylindric algebras (CA's) and polyadic equality algebras (PEA's), and yet in certain ways they are quite diierent. The links and diierences allow for constructive interaction between these sub...

متن کامل

Bare canonicity of representable cylindric and polyadic algebras

We show that for finite n ≥ 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived fr...

متن کامل

Algebraic Logic Iv. Equality in Polyadic Algebras

Introduction. A standard way to begin the study of symbolic logic is to describe one after another the propositional calculus, the monadic functional calculus, the pure first-order functional calculus, and the functional calculus with equality. The algebraic aspects of these logical calculi belong to the theories of Boolean algebras, monadic algebras, polyadic algebras, and cylindric algebras r...

متن کامل

A non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct

We construct an infinite dimensional quasi-polyadic equality algebra A such that its cylindric reduct is representable, while A itself is not representable. 1 The most well known generic examples of algebraizations of first order logic are Tarski’s cylindric algebras (CA) and Halmos’ polyadic equality algebras (PEA). The theory of cylindric algebras is well developed in the treatise [10], [11],...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012